N-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling

Abstract System-wide optimization of distributed manufacturing operations enables process improvement beyond the standalone and individual optimality norms. This study addresses production planning a system consisting three stages: parts (subcomponents), assembly components in Original Equipment Manufacturer (OEM) factories, final products at product manufacturer’s factory. Distributed Three Stage Assembly Permutation Flowshop Scheduling Problems (DTrSAPFSP) models this operational situation; it is most recent development literature scheduling problems, which has seen very limited for possible industrial applications. research introduces highly efficient constructive heuristic to contribute on DTrSAPFSP. Numerical experiments considering comprehensive set parameters are undertaken evaluate performance benchmark algorithms. It shown that N-list-enhanced Constructive Heuristic algorithm performs significantly better than current best-performing new metaheuristics terms both solution quality computational time. can, therefore, be considered competitive future studies computing.